Maintaining Global Hull Consistency with Local Search for Continuous CSPs
نویسندگان
چکیده
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational efforts required. In alternative to local consistency, we propose maintaining global hull-consistency and present experimental results that show that this may be an appropriate alternative to other higher order consistencies. We tested various global hull enforcing algorithms and the best results were obtained with the integration of a local search procedure within interval constraint propagation.
منابع مشابه
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution space and the computational effort required. In alternative to local consistency, which is usually maintained in handling continuous constraints, we discuss maintaining global hull-consistency. Experimental results sho...
متن کاملProbabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de facto standard to solve CSPs. Maintaining higher levels of consistency, generally, reduces the search effort. However, due to ineffective constraint propagation, it often penalises the search algorithm in terms of time....
متن کاملSome Practicable Filtering Techniques for the Constraint Satisfaction Problem
Filtering techniques are essential in order to ef ciently solve constraint satisfaction problems CSPs A blind search often leads to a com binatorial explosion the algorithm repeatedly nding the same local inconsistencies Main taining a local consistency can strongly reduce the search e ort especially on hard and large problems A good illustration are the good time performances on such problems ...
متن کاملMaintaining Arc-Consistency in Stochastic Local Search
Combining advantages of different paradigms such as stochastic local search and constraint propagation is a research area of current interest, but implementing such hybrids is a non-trivial task. This paper describes a straightforward combination of existing search and modeling techniques, yielding a local search algorithm that maintains arc-consistency for binary CSPs. On a set of bandwidth gr...
متن کاملGlobal Consistency for Continuous Constraints
This paper provides a technique for solving general constraint satisfaction problems (CSPs) with continuous variables. Constraints are represented by a hierarchical binary decomposition of the space of feasible values. We propose algorithms for pathand higher degrees of consistency based on logical operations defined on this representation and demonstrate that the algorithms terminate in polyno...
متن کامل